Evolving algebras 1993: Lipari guide
نویسنده
چکیده
2 Static Algebras and Updates 4 2.1 Static Algebras: Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Vocabularies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Definition of Static Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Terms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.5 Locations and Updates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.6 Update Sets and Families of Update Sets . . . . . . . . . . . . . . . . . . . . . . . . 6 2.7 Conservative Determinism vs. Local Nondeterminism . . . . . . . . . . . . . . . . . . 7
منابع مشابه
Evolving Algebras: an Attempt to Discover Semantics
This tutorial is based on lecture notes from the Fall 1990 course on Principles of Programming Languages at the University of Michigan. (My young friend Quisani did not attend the lectures.) The present version incorporates some changes provoked by the necessity to update the bibliography. The main part of the paper is still the same, however, and the examples are unchanged even though many thi...
متن کاملThe Semantics of the C Programming Language
We present formal operational semantics for the C programming language. Our starting point is the ANSI standard for C as described in [KR]. Knowledge of C is not necessary (though it may be helpful) for comprehension, since we explain all relevant aspects of C as we proceed. Our operational semantics is based on evolving algebras. An exposition on evolving algebras can be found in the tutorial ...
متن کاملThe bakery algorithm: yet another specification and verification
In a meeting at Schloss Dagstuhl in June 1993, Uri Abraham and Menachem Magidor have challenged the thesis that an evolving algebra can be tailored to any algorithm at its own abstraction level. As example they gave an instructive proof which uses lower and higher views to show correctness of Lamport's bakery algorithm. We construct two evolving algebras capturing lower and higher view respecti...
متن کاملCHARACTERIZATIONS OF EXTREMELY AMENABLE FUNCTION ALGEBRAS ON A SEMIGROUP
Let S be a semigroup. In certain cases we give some characterizations of extreme amenability of S and we show that in these cases extreme left amenability and extreme right amenability of S are equivalent. Also when S is a compact topological semigroup, we characterize extremely left amenable subalgebras of C(S), where C(S) is the space of all continuous bounded real valued functions on S
متن کاملState Transitions modeled as Re nements
We are going to show how state transitions can be modeled in the framework of algebraic speci cations. We use the algebraic speci cation, composition, and re nement framework provided by the Specware tool [28, 29] and Evolving Algebras [10] as a general framework for transition systems. Numerous case studies show that evolving algebras are well suited to model large and complex reactive and con...
متن کامل